Finite Biprefix Sets of Path in a Graph
نویسنده
چکیده
The main results of the combinatorial theory of maximal biprefix codes of words (Ckari, Perrin, Schtitzenberger) are extended to the codes of paths in a graph in this paper: degree and decoding of double-infinite paths, finiteness of codes of a given degree, the CCsari-Schiitzenberger algorithm, derivation and integration of codes will be discussed.
منابع مشابه
Different-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملConjugacy of finite biprefix codes
Two languagesX and Y are called conjugates, if they satisfy the conjugacy equationXZ = ZY for some non-empty language Z . We will compare solutions of this equation with those of the corresponding equation of words and study the case of finite biprefix codes X and Y . We show that themaximal Z in this case is rational.Wewill also characterize X and Y in the case where they are both finite bipre...
متن کاملOn the Syntactic Transformation Semigroup of a Language Generated by a Finite Biprefix Code
Let P be a finite biprefix code and let >t: = (9, S) be the syntactic transformation semigroup fts:r of P’. We show that if e ES is an idenpotent, then the ts X, = (Qe, eSe) CORS~~+S of partial one to one maps. We also show that any ts of partial one to one maps divides a ts ci partial one fto one maps which is the syntactic ts of a finite biprefix code.
متن کاملCERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملAn Alexandroff topology on graphs
Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 58 شماره
صفحات -
تاریخ انتشار 1986